Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
601	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics
602	Cognitively-Inspired Computational Design Methods Jonathan Cagan Dept of Mechanical Engineering and Add to Reading List Source URL: www.lrdc.pitt.edu Language: English - Date: 2007-11-30 09:54:00 Kotovsky Complexity classes FP FL
603	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
604	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-11-07 20:15:16 Complexity classes NTIME Circuit complexity P Bounded-error probabilistic polynomial Cook–Levin theorem Time hierarchy theorem NEXPTIME Time complexity Theoretical computer science Computational complexity theory Applied mathematics
605	16 CHAPTER 2. LEADER ELECTION of each node has the same structure. We will now show that non-uniform anonymous leader election for synchronous rings is impossible. The idea is that Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Distributed data storage Analysis of algorithms Probabilistic complexity theory Randomized algorithm Distributed algorithm Graph coloring Leader election Distributed computing Consensus Theoretical computer science Mathematics Computational complexity theory
606	Dynamics of Algorithmic Processing in Computer Systems Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-06-20 13:21:03 Analysis of algorithms Computational complexity theory Sorting algorithms Algorithm Complexity Best worst and average case Insertion sort Worst-case complexity Distributed computing Theoretical computer science Applied mathematics Mathematics
607	CCCG 2006, Kingston, Ontario, August 14–16, 2006 On Bipartite Matching under the RMS Distance Pankaj K. Agarwal∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:06 Analysis of algorithms Computational complexity theory Time complexity Ordinal number Matching Euclidean algorithm Symbol Theoretical computer science Applied mathematics Mathematics
608	LNCSA Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:26:19 Analysis of algorithms NP-complete problems Parameterized complexity Kernelization Dominating set Time complexity Algorithm Mathematical optimization NP Theoretical computer science Computational complexity theory Applied mathematics
609	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
610	ICS 260 – Fall 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:38 Complexity classes NP-complete problems Mathematical optimization Operations research Travelling salesman problem NP Induced path Independent set Directed acyclic graph Theoretical computer science Graph theory Computational complexity theory

UPDATE